An approach to covering dimensions ∗
نویسنده
چکیده
Using certain ideas connected with the entropy theory, several kinds of dimensions are introduced for arbitrary topological spaces. Their properties are examined, in particular, for normal spaces and quasi-discrete ones. One of the considered dimensions coincides, on these spaces, with the Čech-Lebesgue dimension and the height dimension of posets, respectively.
منابع مشابه
A robust approach to multi period covering location-allocation problem in pharmaceutical supply chain
This paper proposes a discrete capacitated covering location-allocation model for pharmaceutical centers. In the presented model, two objectives are considered; the first one is minimization of costs and the second one try to maximize customer satisfaction by definition of social justice. Social justice in the model means that we consider customers satisfaction by using distance. the introduced...
متن کاملA New Approach to Covering
For finite coverings in euclidean d-space E we introduce a parametric density function. Here the parameter controls the influence of the boundary of the covered region to the density. This definition gives an new approach to covering which is similar to the approach for packing in [BHW]. In this way we obtain a unified theory for finite and infinite covering and generalize similar results for d...
متن کاملA Robust Optimization Approach for a p-Hub Covering Problem with Production Facilities, Time Horizons and Transporter
Hub location-allocation problems are currently a subject of keen interest in the research community. However, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. In this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some param...
متن کاملMathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters
The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...
متن کاملA new multi-mode and multi-product hub covering problem: A priority M/M/c queue approach
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...
متن کامل